Graph norms and Sidorenko’s conjecture

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph norms and Sidorenko’s conjecture

2 Definitions and main results 3 2.1 Notations and definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Graph norms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Schatten-von Neumann classes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.4 Hölder and weakly Hölder graphs . . . . . . . . . . . . ....

متن کامل

The Weiss conjecture and weak norms

In this note we show that for analytic semigroups the so-called Weiss condition of uniform boundedness of the operators Re(λ) 1/2C(λ+A)−1, Re(λ) > 0 on the complex right half plane and weak Lebesgue L2,∞–admissibility are equivalent. Moreover, we show that the weak Lebesgue norm is best possible in the sense that it is the endpoint for the ’Weiss conjecture’ within the scale of Lorentz spaces L...

متن کامل

Falconer’s Distance Set Conjecture for Polygonal Norms

A conjecture of Falconer [F86] asserts that if E is a planar set with Hausdorff dimension strictly greater than 1, then its Euclidean distance set ∆(E) has positive one-dimensional Lebesgue measure. We review recent work on the analogous question with the Euclidean distance replaced by non-Euclidean norms ‖·‖X in which the unit ball is a polygon, and construct explicit examples of sets with lar...

متن کامل

Alexander and Thurston Norms of Graph Links

We show that the Alexander and Thurston norms are the same for all irreducible Eisenbud-Neumann graph links in homology 3-spheres. These are the links obtained by splicing Seifert links in homology 3-spheres together along tori. By combining this result with previous results, we prove that the two norms coincide for all links in S3 if either of the following two conditions are met; the link is ...

متن کامل

Finite reflection groups and graph norms

Given a graph H on vertex set {1, 2, · · · , n} and a function f : [0, 1] → R, define ‖f‖H := ∣∣∣∣∣ ∫ ∏ ij∈E(H) f(xi, xj)dμ |V (H)| ∣∣∣∣∣ 1/|E(H)| , where μ is the Lebesgue measure on [0, 1]. We say that H is norming if ‖·‖H is a semi-norm. A similar notion ‖·‖r(H) is defined by ‖f‖r(H) := ‖|f |‖H and H is said to be weakly norming if ‖·‖r(H) is a norm. Classical results show that weakly normin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 2010

ISSN: 0021-2172,1565-8511

DOI: 10.1007/s11856-010-0005-1